Twinless Strongly Connected Components
نویسنده
چکیده
Tarjan [9], describes how depth first search can be used to identify Strongly Connected Components (SCC) of a directed graph in linear time. It is standard to study Tarjan’s SCC algorithm in most senior undergraduate or introductory graduate computer science algorithms courses. In this paper we introduce the concept of a twinless strongly connected component (TSCC) of a directed graph. Loosely stated, a TSCC of a directed graph is (i) strongly connected and (ii) remains strongly connected even if we require the deletion of arcs from the component so that it does not contain a pair of twin arcs (twin arcs are a pair of bidirected arcs (i, j) and (j, i) where the tail of one arc is the head of the other and vice versa). This structure has diverse applications, from the design of telecommunication networks [7] to structural stability of buildings [8]. In this paper, we illustrate the relationship between 2-edge connected components of an undirected graph—obtained from the strongly connected components of a directed graph—and twinless strongly connected components. We use this relationship to develop a linear time algorithm to identify all the twinless strongly connected components of a directed graph. We then consider the augmentation problem, and based on the structural properties developed earlier, derive a linear time algorithm for the augmentation problem.
منابع مشابه
On spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملFinding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple O(mn)-time algorithms were known. We use a hierarchical sparsifi...
متن کاملOn the Induced Matching Problem
We study extremal questions on induced matchings in certain natural graph classes. We argue that these questions should be asked for twinless graphs, that is graphs not containing two vertices with the same neighborhood. We show that planar twinless graphs always contain an induced matching of size at least n/40 while there are planar twinless graphs that do not contain an induced matching of s...
متن کاملSynchronization via Pinning Control on General Complex Networks
This paper studies synchronization via pinning control on general complex dynamical networks, such as strongly connected networks, networks with a directed spanning tree, weakly connected networks, and directed forests. A criterion for ensuring network synchronization on strongly connected networks is given. It is found that the vertices with very small in-degrees should be pinned first. In add...
متن کامل